Global convergence of a non-convex Douglas–Rachford iteration
نویسندگان
چکیده
منابع مشابه
Global convergence of a non-convex Douglas-Rachford iteration
maximal monotone operator theory has recently turned fifty years old. In the first part of the talk, I shall try to explain why maximal(ly) monotone operators are both interesting and important objects while briefly survey the history of the subject — culminating with a description of the remarkable progress made during the past decade. In the second part of the talk, I shall describe in more d...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملConvergence results: A new type iteration scheme for two asymptotically nonexpansive mappings in uniformly convex Banach spaces
In this article, we introduce a new type iterative scheme for approximating common fixed points of two asymptotically nonexpansive mappings is defined, and weak and strong convergence theorem are proved for the new iterative scheme in a uniformly convex Banach space. The results obtained in this article represent an extension as well as refinement of previous known resu...
متن کاملStochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly in each iteration. The requirements of convergence are given for the general case. To demonstrate the basic idea, a very simple, continuous random transport operator is examined, which gives back the light tracing algor...
متن کاملTransformations of Nested Loops with Non-Convex Iteration Spaces
When compiling for parallel machines, it is often necessary to generate a loop nest to scan a region of index points in lexicographic order. One well-known application example is the use of loop transformations to restructure loop nests. Previous work shows how to generate code to scan a convex polyhedron (possibly intersected with a lattice), a region derived from an application of a non-singu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-9958-4